Querying with Vague Quantifiers Using Probabilistic Semantics

نویسندگان

  • Christian G. Fermüller
  • Matthias F. J. Hofer
  • Magdalena Ortiz
چکیده

Many realistic scenarios call for answers to questions involving vague expressions like almost all, about half, or at least about a third. We present a modular extension of classical first-order queries over relational databases, with binary, proportional, semi-fuzzy quantifiers modeling such expressions via random sampling. The extended query language has an intuitive semantics and allows one to pose natural queries with probabilistic answers. This is also demonstrated by experiments with an implementation involving the (geographical) MONDIAL data set.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Logic of Nonmonotonic Conditionals and Conditional Probabilities: Predicate Logic

In a previous paper I described a range of nonmonotonic conditionals that behave like conditional probability functions at various levels of probabilistic support. These conditionals were defined as semantic relations on an object language for sentential logic. In this paper I extend the most prominent family of these conditionals to a language for predicate logic. My approach to quantifiers is...

متن کامل

Generalizing Term Subsumption Languages to Fuzzy Logic

During the past decade, knowledge representation research in AI has generated a class of languages called term subsumption languages (TSL), which is a knowledge representation formalism with a well-defined logic-based semanticsDue to its formal semantics, a term subsumption system can automatically infer the subsumption relationships between concepts defined in the system. However, these system...

متن کامل

Towards Probabilistic Knowledge Bases

We deene a new xpoint semantics for rule-based reasoning in the presence of vague or imprecise information. Such a semantics should fullll two requirements. First, it must coincide with the intuitive understanding of the given information, and second, the semantics must be computationally tractable. We show that our semantics fulllls the rst requirement and we formally verify that our xpoint se...

متن کامل

pSPARQL: A Querying Language for Probabilistic RDF (Extended Abstract)

In this paper, we present a querying language for probabilistic RDF databases, where each triple has a probability, called pSRARQL, built on SPARQL, recommended by W3C as a querying language for RDF databases. Firstly, we present the syntax and semantics of pSPARQL. Secondly, we define the query problem of pSPARQL corresponding to probabilities of solutions. Finally, we show that the query eval...

متن کامل

Extending dynamic queries to handle uncertain data

Dynamic querying is a technique which has been used successfully to enable novice users to gain access to and insight into data in databases. Some multimedia archives (such as archives of African art) contain data which have vague locations in time and space, that is, although there is some idea of when and where the entity originated, the precise information is unknown. This uncertainty create...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017